Exponential random graph models of preschool affiliative networks
نویسندگان
چکیده
منابع مشابه
Exponential random graph models for multilevel networks
Modern multilevel analysis, whereby outcomes of individuals within groups take into account group membership, has been accompanied by impressive theoretical development (e.g. Kozlowski and Klein, 2000) and sophisticated methodology (e.g. Snijders and Bosker, 2012). But typically the approach assumes that links between groups are non-existent, and interdependence among the individuals derives so...
متن کاملExponential random graph models for affiliation networks
Statistical modeling of social networks as complex systems has always been and remains a challenge for social scientists. Exponential family models give us a convenient way of expressing local network structures that have sufficient statistics for their corresponding parameters. This kind of model, known as Exponential Random Graph Models (ERGMs), or p∗ models, have been developed since the 198...
متن کاملExponential random graph models
Synonyms p* models, p-star models, p1 models, exponential family of random graphs, maximum entropy random networks, logit models, Markov graphs Glossary • Graph and network: the terms are used interchangeably in this essay. • Real-world network: (real network, observed network) means network data the researcher has collected and is interested in modelling. • Ensemble of graphs: means the set of...
متن کاملLearning Exponential Random Graph Models
Exponential Random Graphs are common, simple statistical models for social network and other structures. Unfortunately, inference and learning with them is hard for networks larger than 20 nodes because their partition functions are intractable to compute precisely. In this paper, we introduce a novel linear-time deterministic approximation to these partition functions. Our main insight enablin...
متن کاملExponential random graph models for networks with community structure
Although the community structure organization is an important characteristic of real-world networks, most of the traditional network models fail to reproduce the feature. Therefore, the models are useless as benchmark graphs for testing community detection algorithms. They are also inadequate to predict various properties of real networks. With this paper we intend to fill the gap. We develop a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Networks
سال: 2013
ISSN: 0378-8733
DOI: 10.1016/j.socnet.2012.11.002